Condorcet choice functions and maximal elements

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Condorcet choice functions and maximal elements

Choice functions on tournaments always select the maximal element (Condorcet winner), provided they exist, but this property does not hold in the more general case of weak tournaments. In this paper we analyze the relationship between the usual choice functions and the set of maximal elements in weak tournaments. We introduce choice functions selecting maximal elements, whenever they exist. Mor...

متن کامل

Maximal Condorcet Domains

A Condorcet domain is a subset of the set of linear orders on a finite set of candidates (alternatives to vote), such that if voters preferences are linear orders belonging to such a subset, then the simple majority rule does not yield cycles. It is well-known that the set of linear orders LO is the Bruhat lattice. We prove that a maximal Condorcet domain is a distributive sublattice in the Bru...

متن کامل

Condorcet Consistent Bundling with Social Choice

We study the problem of computing optimal bundles given agents’ preferences over individual items when agents derive satisfaction from the entire bundle under constraints on the size k of the bundle. Building on the notion of Condorcet winning sets by Gehrlein [16], we extend common Condorcet consistent voting rules from the single winner voting setting to that of forming bundles of size k. Our...

متن کامل

Maximal elements of sub-topical functions with applications to global optimization

We study the support sets of sub-topical functions‎ ‎and investigate their maximal elements in order to establish a necessary and sufficient condition‎ ‎for the global minimum of the difference of two sub-topical functions‎.

متن کامل

First-Choice Maximal and First-Choice Stable School Choice Mechanisms∗

We investigate the class of school choice mechanisms that are first-choice maximal (FCM) (i.e., they match a maximal number of students to their reported first choices) and first-choice stable (FCS) (i.e., no students form blocking pairs with their reported first choices). FCM is a ubiquitous desideratum in school choice, and we show that FCS is the only rank-based relaxation of stability that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Choice and Welfare

سال: 2005

ISSN: 0176-1714,1432-217X

DOI: 10.1007/s00355-003-0312-0